Search results
21 packages found
https://en.wikipedia.org/wiki/Trie
Trie, Prefix tree. Javascript & Typescript Data Structure.
- Trie
- prefix tree
- prefixtree
- Prefix tree
- prefix-tree
- prefix
- digital tree
- digitaltree
- Digital Tree
- digital-tree
- digital
- radix tree
- radixtree
- Radix Tree
- View more
Javascript Data Structure. Heap, Binary Tree, Red Black Tree, Linked List, Deque, Trie, HashMap, Directed Graph, Undirected Graph, Binary Search Tree(BST), AVL Tree, Priority Queue, Graph, Queue, Tree Multiset, Singly Linked List, Doubly Linked List, Max
- data
- structure
- structures
- data structure
- datastructure
- data-structure
- data structures
- datastructures
- data-structures
- in data structures
- in data structure
- binary
- depth
- breadth
- View more
Javascript Data Structure. Heap, Binary Tree, Red Black Tree, Linked List, Deque, Trie, HashMap, Directed Graph, Undirected Graph, Binary Search Tree(BST), AVL Tree, Priority Queue, Graph, Queue, Tree Multiset, Singly Linked List, Doubly Linked List, Max
- data
- structure
- structures
- data structure
- datastructure
- data-structure
- data structures
- datastructures
- data-structures
- in data structures
- in data structure
- binary
- depth
- breadth
- View more
Fast prefix operations for strings of digits
A lightweight trie implementation.
This package provides a powerful Radix data storage and retrieval library for TypeScript. It allows you to efficiently store and manage structured data using a Radix tree data structure.
Divide et impera. Organize declarative routes in an imperative way for trie, radix or prefix routers
A trie implementation in typescript with configurable string delimiters
a JavaScript P(lain) O(ld) D(ictionary) with element access by prefixes, implemented with a trie
A flexible implementation of a trie (prefix tree) to let you efficiently find partial and complete matches of stored values. A trie is a tree-like data structure, also referred to as a prefix tree, that enables optimized searching for specific keys from a
Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.
A compact trie for mapping keys to values
20% Cooler Boilerplate
A serializable compact prefix trie
- compact-prefix-tree
- compact-radix-tree
- compact-trie
- data-structure
- patricia-tree
- prefix-tree
- prefix
- radix-tree
- trie
Readonly but memory-sufficient data structure for dictionaries
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
TypeScript library providing a trie (prefix tree) datastructure.